This completely self-contained study, widely considered the best book in the field, is intended to serve both as an introduction to quantification theory and as ...

This book presents a systematic, unified treatment of fixed points as they occur in Godels incompleteness proofs, recursion theory, combinatory logic, semantics, and metamathematics. Packed with instructive problems and solutions, the book offers an excellent introduction to the subject and highlights recent research.

This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

Puzzles of logic involve knights, knaves, gods, demons, and mortals, and Inspector Craig conducts a summer-long adventure in combinatory logic, basic to computer science and artificial intelligence.